Reconsideration on Non-Linear Base Orderings
نویسندگان
چکیده
Reconsideration is a belief change operation that re-optimizes a finite belief base following a series of belief change operations—provided all base beliefs have a linear credibility ordering. This paper shows that linearity is not required for reconsideration to improve and possibly optimize a belief base.
منابع مشابه
Dependency-Directed Reconsideration Belief Base Optimization for Truth Maintenance Systems
We define reconsideration, a non-prioritized belief change operation on a finite set of base beliefs. Reconsideration is a hindsight belief change repair that eliminates negative effects caused by the order of previously executed belief change operations. Beliefs that had previously been removed are returned to the base if there no longer are valid reasons for their removal. This might result i...
متن کاملHessian Stochastic Ordering in the Family of multivariate Generalized Hyperbolic Distributions and its Applications
In this paper, random vectors following the multivariate generalized hyperbolic (GH) distribution are compared using the hessian stochastic order. This family includes the classes of symmetric and asymmetric distributions by which different behaviors of kurtosis in skewed and heavy tail data can be captured. By considering some closed convex cones and their duals, we derive some necessary and s...
متن کاملImproving Recovery for Belief Bases
The Recovery postulate for contraction says that any beliefs lost due to the contraction of some belief p should return if p is immediately re-asserted. Recovery holds for logically closed sets of beliefs, but it does not hold for belief bases (sets of beliefs that are not logically closed). This paper discusses the Recovery aspect of the belief base optimizing operation of reconsideration (whi...
متن کاملBelief Change with Reconsideration
Given a knowledge representation and reasoning (KRR) system, this paper introduces the concept of reconsideration — where past belief change operations can be reconsidered. Specifically, beliefs retracted during past revisions might be returned to the belief base. . . and, conversely, base beliefs retained during previous revisions might be lost. We show the need for reconsideration in both ide...
متن کاملComplementation of Rational Sets on Countable Scattered Linear Orderings
In a preceding paper (Bruyère and Carton, automata on linear orderings, MFCS’01), automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite and even transfinite words studied by Büchi. Kleene’s theorem has been generalized to these words. We prove that rational sets of words on countable scattered linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006